A mean value algorithm for Toeplitz matrix completion

A Singular Value Thresholding Algorithm for Matrix Completion

This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of recovering a large matrix from a small subset of its entries (the famous Netflix problem). Off-the-sh...

A Subnormal Toeplitz Completion Problem

We give a brief survey of subnormality and hyponormality of Toeplitz operators on the vector-valued Hardy space of the unit circle. We also solve the following subnormal Toeplitz completion problem: Complete the unspecified rational Toeplitz operators (i.e., the unknown entries are rational Toeplitz operators) of the partial block Toeplitz matrix

A Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times

We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...

Mean-shift algorithms for manifold denoising, matrix completion and clustering

An improved Toeplitz algorithm for polynomial matrix null-space computation

In this paper we present an improved algorithm to compute the minimal null-space basis of polynomial matrices, a problem which has many applications in control and systems theory. This algorithm takes advantage of the block Toeplitz structure of the Sylvester matrix associated with the polynomial matrix. The analysis of algorithmic complexity and numerical stability shows that the algorithm is ...